منابع مشابه
Topology Preserving Graph Matching
We describe an algorithm for graph matching which preserves global topological structure using an homology preserving graph matching. We show that for simplicial homology, graph matching is equivalent to finding an optimal simplicial chain map, which can be posed as a linear program satisfying boundary commutativity, simplex face intersection and assignment constraints. The homology preserving ...
متن کاملSynchronization and Graph Topology
This paper clarifies the relation between synchronization and graph topology. Applying the Connection Graph Stability method developed by Belykh et al. [2004a] to the study of synchronization in networks of coupled oscillators, we show which graph properties matter for synchronization. In particular, while we explicitly link the stability of synchronization with the average path length for a wi...
متن کاملInference of Graph Topology
Gonzalo Mateos,a,∗, Santiago Segarra∗∗ and Antonio G. Marques† ∗University of Rochester, Dept. of Electrical and Computer Engineering, Rochester, NY, United States. ∗∗Massachusetts Institute of Technology, Institute for Data, Systems, and Society, Cambridge, MA, United States. †King Juan Carlos University, Dept. of Signal Theory and Communications, Madrid, Spain aCorresponding: [email protected]...
متن کاملThe Topology of Graph Products of Groups
Given a finite (connected) simplicial graph with groups assigned to the vertices, the graph product of the vertex groups is the free product modulo the relation that adjacent groups commute. The graph product of finitely presented infinite groups is both semistable at infinity and quasi-simply filtrated. Explicit bounds for the isoperimetric inequality and isodiametric inequality for graph prod...
متن کاملOn the Topology of Graph Picture Spaces
We study the space X (G) of pictures of a graph G in complex projective d-space. The main result is that the homology groups (with integer coefficients) of X (G) are completely determined by the Tutte polynomial of G. One application is a criterion in terms of the Tutte polynomial for independence in the d-parallel matroids studied in combinatorial rigidity theory. For certain special graphs ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Journal of Mathematical Analysis
سال: 2011
ISSN: 1735-8787
DOI: 10.15352/bjma/1313362980